منابع مشابه
Causal Learnability
The ability to predict, or at least recognize, the state of the world that an action brings about, is a central feature of autonomous agents. We propose, herein, a formal framework within which we investigate whether this ability can be autonomously learned. The framework makes explicit certain premises that we contend are central in such a learning task: (i) slow sensors may prevent the sensin...
متن کاملLearnability of syntax 1 Running head: LEARNABILITY OF SYNTAX The learnability of abstract syntactic principles
The learnability of abstract syntactic principles Children acquiring language infer the correct form of syntactic constructions for which they appear to have little or no direct evidence, avoiding simple but incorrect generalizations that would be consistent with the data they receive. These generalizations must be guided by some inductive bias – some abstract knowledge – that leads them to pre...
متن کاملLearnability of syntax 1 Running head : LEARNABILITY OF SYNTAX
The learnability of abstract syntactic principles Children acquiring language infer the correct form of syntactic constructions for which they appear to have little or no direct evidence, avoiding simple but incorrect generalizations that would be consistent with the data they receive. These generalizations must be guided by some inductive bias – some abstract knowledge – that leads them to pre...
متن کاملLearnability of Non-I.I.D
Learnability has always been one of the most central problems in learning theory. Most previous studies on this issue were based on the assumption that the samples are drawn independently and identically according to an underlying (unknown) distribution. The i.i.d. assumption, however, does not hold in many real applications. In this paper, we study the learnability of problems where the sample...
متن کاملQuantum DNF Learnability Revisited
We describe a quantum PAC learning algorithm for DNF formulae under the uniform distribution with a query complexity of Õ(s/ǫ+ s/ǫ), where s is the size of DNF formula and ǫ is the PAC error accuracy. If s and 1/ǫ are comparable, this gives a modest improvement over a previously known classical query complexity of Õ(ns/ǫ). We also show a lower bound of Ω(s logn/n) on the query complexity of any...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1994
ISSN: 0022-0000
DOI: 10.1016/s0022-0000(05)80005-4